package 二分查找;

import java.util.Scanner;

public class 解立方根2 {
    static double esp = 1e-4;

    public static void main(String[] args) {

        Scanner scanner = new Scanner(System.in);
        int i = 1;

        while (i != 0) {
            double K = scanner.nextDouble();
            double r = K;
            double l = 0;
            while (l + esp < r) {
                double mid = (l + r) / 2;
                if (check(mid, K)) {
                    r = mid;
                } else {
                    l = mid;
                }
            }
            System.out.println(String.format("%.0f", l));
            i--;
        }
    }

    private static boolean check(double mid, double K) {
        double pow = Math.pow(mid, 3);
        if (pow >= K) {
            return true;
        } else {
            return false;
        }
    }
}
